Sequent Calculus for Euler Diagrams
نویسنده
چکیده
Proof systems play a major role in the formal study of diagrammatic logical systems. Typically, the style of inference is not directly comparable to traditional sentential systems, to study the the diagrammatic aspects of inference. In this work, we present a proof system for Euler diagrams with shading in the style of sequent calculus. We prove it to be sound and complete. Furthermore we outline how this system can be extended to incorporate heterogeneous logical descriptions. Finally, we explain how small changes allow for reasoning with intuitionistic logic.
منابع مشابه
An analytic study on the Euler-Lagrange equation arising in calculus of variations
The Euler-Lagrange equation plays an important role in the minimization problems of the calculus of variations. This paper employs the differential transformation method (DTM) for finding the solution of the Euler-Lagrange equation which arise from problems of calculus of variations. DTM provides an analytical solution in the form of an infinite power series with easily computable components. S...
متن کاملDrawing Euler Diagrams from Region Connection Calculus Specifications with Local Search
This paper describes a local search based approach and a software tool to approximate the problem of drawing Euler diagrams. Specifications are written using RCC-8-constraints and radius constraints. Euler diagrams are described as set of circles.
متن کاملA Tool for Generating Interactive Euler Diagrams
We describe a tool for generating Euler diagrams from a set of region connection calculus formulas. The generation is based on a variant of local search capturing default reasoning for improving aesthetic appearance of Euler diagrams. We also describe an optimization for diagrams to be interactive: the user can modify the diagram with the mouse while formulas are still satisfied. We also discus...
متن کاملProof diagrams for multiplicative linear logic
The original idea of proof nets can be formulated by means of interaction nets syntax. Additional machinery as switching, jumps and graph connectivity is needed in order to ensure correspondence between a proof structure and a correct proof in sequent calculus. In this paper we give an interpretation of proof nets in the syntax of string diagrams. Even though we lose standard proof equivalence,...
متن کاملEquivalence of Local Complementation and Euler Decomposition in the Qutrit ZX-calculus
In this paper, we give a modified version of the qutrit ZX-calculus, by which we represent qutrit graph states as diagrams and prove that the qutrit version of local complementation property is true if and only if the qutrit Hadamard gate H has an Euler decomposition into 4π/3-green and red rotations. This paves the way for studying the completeness of qutrit ZX-calculus for qutrit stabilizer q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018